constant factor
Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methods
Neural Information Processing Systems http://nips.cc/
Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
We consider nonconvex stochastic optimization problems in the asynchronous centralized distributed setup where the communication times from workers to a server can not be ignored, and the computation and communication times are potentially different for all workers.
Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
(Theorem 4). We also consider Assumption 3. Note that this assumption does not restrict the class of considered Iterative algorithms are traditionally evaluated based on their gradient complexity .
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons
Wenbo Ren, Jia (Kevin) Liu, Ness Shroff
Neural Information Processing Systems http://nips.cc/
46489c17893dfdcf028883202cefd6d1-Paper.pdf
In this paper, we study stochastic structured bandits for minimizing regret.
